Inductive theorem proving based on tree grammars
نویسندگان
چکیده
منابع مشابه
Inductive theorem proving based on tree grammars
Induction plays a key role for reasoning in many areas of mathematics and computer science. A central problem for the automation of proof by induction is the non-analytic nature of induction invariants. In this paper we present an algorithm for proving universal statements by induction that separates this problem into two phases. The first phase consists of a structural analysis of witness term...
متن کاملMatrix-Based Inductive Theorem Proving
R.Dyckhoff, ed., International Conference TABLEAUX-2000, LNAI 1847, pp. 294–309, c ©Springer Verlag, 2000. Abstract. We present an approach to inductive theorem proving that integrates rippling-based rewriting into matrix-based logical proof search. The selection of appropriate connections in a matrix proof is guided by the symmetries between induction hypothesis and induction conclusion while ...
متن کاملFocused Inductive Theorem Proving
Focused proof systems provide means for reducing and structuring the non-determinism involved in searching for sequent calculus proofs. We present a focused proof system for a first-order logic with inductive and co-inductive definitions in which the introduction rules are partitioned into an asynchronous phase and a synchronous phase. These focused proofs allow us to naturally see proof search...
متن کاملConnection-Driven Inductive Theorem Proving
We present a method for integrating rippling-based rewriting into matrix-based theorem proving as a means for automating inductive specification proofs. The selection of connections in an inductive matrix proof is guided by symmetries between induction hypothesis and induction conclusion. Unification is extended by decision procedures and a rippling/reverse-rippling heuristic. Conditional subst...
متن کاملTree-Based Heuristics in Modal Theorem Proving
We use a strong form of the tree model property to boost the performance of resolution-based first-order theorem provers on the so-called relational translations of modal formulas. We provide both the mathematical underpinnings and experimental results concerning our improved translation method.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2015
ISSN: 0168-0072
DOI: 10.1016/j.apal.2015.01.002